Improved Elliptic Curve Multiplication Methods Resistant against Side Channel Attacks
نویسندگان
چکیده
We improve several elliptic curve multiplication algorithms secure against side channel attacks (SCA). While some efficient SCAresistant algorithms were developed that apply only to special classes of curves, we are interested in algorithms that are suitable for general elliptic curves and can be applied to the recommended curves found in various standards. We compare the running time and memory usage of the improved schemes.
منابع مشابه
Securing Elliptic Curve Point Multiplication against Side-Channel Attacks
For making elliptic curve point multiplication secure against side-channel attacks, various methods have been proposed using special point representations for specifically chosen elliptic curves. We show that the same goal can be achieved based on conventional elliptic curve arithmetic implementations. Our point multiplication method is much more general than the proposals requiring non-standar...
متن کاملParallel scalar multiplication on general elliptic curves over Fp hedged against Non-Differential Side-Channel Attacks
For speeding up elliptic curve scalar multiplication and making it secure against side-channel attacks such as timing or power analysis, various methods have been proposed using speci cally chosen elliptic curves. We show that both goals can be achieved simultaneously even for conventional elliptic curves over Fp . This result is shown via two facts. First, we recall the known fact that every e...
متن کاملFast Elliptic Curve Multiplications Resistant against Side Channel Attacks
This paper proposes fast elliptic curve multiplication algorithms resistant against side channel attacks, based on the Montgomerytype scalar multiplication. The proposed scalar multiplications can be applied to all curves over prime fields, e.g., any standardized curves over finite fields with characteristic larger than 3. The method utilizes the addition formulas xECDBL and xECADD assembled by...
متن کاملParallelizable Elliptic Curve Point Multiplication Method with Resistance against Side-Channel Attacks
We present a new 2-ary elliptic curve point multiplication method with resistance against side-channel attacks. This method provides two advantages compared with previous similar side-channel attack countermeasures: It avoids a fixed table, thus reducing potential information leakage available to adversaries; and it is easily parallelizable on two-processor systems, where it provides much impro...
متن کاملA Fast Parallel Elliptic Curve Multiplication Resistant against Side Channel Attacks
This paper proposes a fast elliptic curve multiplication algorithm applicable for any types of curves over finite fields Fp (p a prime), based on [Mon87], together with criteria which make our algorithm resistant against the side channel attacks (SCA). The algorithm improves both on an addition chain and an addition formula in the scalar multiplication. Our addition chain requires no table look...
متن کامل